def serch():
global n,l,x,y,left
for i in range(n):
left += l[i]
if y >= left >= x:
break
elif left > y:
return 0
right = sum(l[i+1:])
for j in range(i+1, n):
if right < x:
return 0
elif right > y:
if y >= left + l[j] >= x:
right -= l[j]
left += l[j]
else:
return 0
else:
return j+1
else:
return 0
n = int(input())
l = list(map(int, input().split()))
x, y = map(int, input().split())
left = 0
print(serch())
#include <bits/stdc++.h>
#include <cmath>
#define ll long long
using namespace std;
int main() {
ll grp1,grp2,i,n,x,y;
while(cin>>n){
ll a[105],sum=0,ans=0;
for(i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
cin>>x>>y;
grp1=0;
grp2=sum;
for(i=1;i<=n;i++){
grp1+=a[i];
grp2-=a[i];
if((grp1>=x && grp1<=y) && (grp2>=x &&grp2<=y))
{
ans=i+1;
break;
}
}
cout<<ans<<endl;
}
}
107B - Basketball Team | 245A - System Administrator |
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |
1459A - Red-Blue Shuffle | 1661B - Getting Zero |
1661A - Array Balancing | 1649B - Game of Ball Passing |
572A - Arrays | 1455A - Strange Functions |
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |